Ultrafast Expected Time Parallel Algorithms
نویسندگان
چکیده
منابع مشابه
Ultafast Expected Time Parallel Algorithms
It has been shown previously that sorting n items into n locations with a polynomial number of processors requires (logn= log logn) time. We sidestep this lower bound with the idea of Padded Sorting, or sorting n items into n+o(n) locations. Since many problems do not rely on the exact rank of sorted items, a Padded Sort is often just as useful as an unpadded sort. Our algorithm for Padded Sort...
متن کاملUltrafast Parallel Algorithms and Recon gurable Meshes
This research is concerned with the development of very fast parallel algorithms, ones faster than those available through normal programming techniques or standard parallel computers. Algorithms have been developed for problems in geometry, graph theory, arithmetic, sorting, and image processing. The computing models that these algorithms have been developed for are concurrent read concurrent ...
متن کاملInternship proposal Algorithms for Expected-Time Reachability
Timed automata are a simple natural model of computation for the specification of timed behaviors [1]. They are finite automata extended with clocks, i.e. real-valued variables that increase with the passage of time. Timed automata have been used in a wide range of applications where real-time aspects of computation is important, and they are supported by a variety of efficient tools and model-...
متن کاملColoring k-Colorable Graphs in Constant Expected Parallel Time
A parallel (CRCW PRAM) algorithm is given to find a k-coloring of a graph randomly drawn from the family of k-colorable graphs with n vertices, where k = logO(l) n. The average running time of the algorithm is constant, and the number of processors is equal to IVI + lEI, where IVI, lEI, resp. is the number of vertices, edges, resp. of the input graph.
متن کاملEstimating the Expected Warning Time of Outbreak-Detection Algorithms
There are some existing evaluation methods, such as the AMOC curve [1], which focus on evaluating the timeliness of alerting algorithms. As the AMOC curve is typically applied in biosurveillance, it plots the expected time to computer-based detection (since the outbreak began) as a function of the false alert rate. In an EWT curve, we add a clinician model and plot the expected time that an alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 1998
ISSN: 0196-6774
DOI: 10.1006/jagm.1997.0892